Crashing Construction Project Schedules by Relocating Resources
نویسندگان
چکیده
منابع مشابه
The construction of stable project baseline schedules
The vast majority of project scheduling efforts assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. In reality, however, project activities are subject to considerable uncertainty, which generally leads to numerous schedule disruptions. It is of interest to develop pre-sche...
متن کاملDistributionally Robust Project Crashing with Partial or No Correlation Information
Crashing is a method for optimally shortening the project makespan by reducing the time of one or more activities in a project network by allocating resources to it. Activity durations are however uncertain and techniques in stochastic optimization, robust optimization and distributionally robust optimization have been developed to tackle this problem. In this paper, we study a class of distrib...
متن کاملReactive Adaptation of Construction Schedules by Applying Simulation-based Optimization
This paper deals with the adaption of construction schedule due to real-time data. This real-time data needs to be evaluated regarding the effects on the schedule. If significant delays or other problems are identified, the schedule should be adapted. That means that under the existing condition a new schedule needs to be generated. Thereby, different constraints of the target schedule like con...
متن کاملDispatchable Execution of Schedules Involving Consumable Resources
Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can bc maxle "dispatchable~, i.e. executable incrementally in real time with guarantees against failure due to unfortunate cvcnt-time selections. In this work wc show how the property of dispatchabi]ity can be extended to ne...
متن کاملDispatchability Conditions for Schedules with Consumable Resources
Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can be made “dispatchable”, i.e., executable incrementally in real time with guarantees against failure due to unfortunate event-time selections. In the present work we show how the property of dispatchability can be extende...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3044645